Fractional solutions for capacitated NTU-games, with applications to stable matchings
نویسندگان
چکیده
منابع مشابه
Fractional solutions for capacitated NTU-games, with applications to stable matchings
In this paper we investigate some new applications of Scarf’s Lemma. First, we introduce the notion of fractional core for NTU-games, which is always nonempty by the Lemma. Stable allocation is a general solution concept for games where both the players and their possible cooperations can have capacities. We show that the problem of finding a stable allocation, given a finitely generated NTU-ga...
متن کاملFractional Solutions for NTU-Games
In this paper we survey some applications of Scarf’s Lemma. First, we introduce the notion of fractional core for NTU-games, which is always nonempty by the Lemma. Stable allocation is a general solution concept for games where both the players and their possible cooperations can have capacities. We show that the problem of finding a stable allocation, given a finitely generated NTU-game with c...
متن کاملThe Geometry of Fractional Stable Matchings and Its Applications
We study the classical stable marriage and stable roommates problems using a polyhedral approach. We propose a new LP formulation for the stable roommates problem, which has a feasible solution if and only if the underlying roommates problem has a stable matching. Furthermore, for certain special weight functions on the edges, we construct a 2-approximation algorithm for the optimal stable room...
متن کاملSingle NTU-value solutions¤
We propose a variation of the non-cooperative bargaining model for n-person games in coalitional form, introduced in Hart and Mas-Colell (1996). This strategic game implements, in the limit, a new NTU-value for the class of monotonic games. This value coincides with the Consistent NTU-value (Maschler and Owen,1989) for hyperplane games, and with the Shapley value for TU games (Shapley, 1953). T...
متن کاملPreference Games and Personalized Equilibria, with Applications to Fractional BGP
We study the complexity of computing equilibria in two classes of network games based on flows fractional BGP (Border Gateway Protocol) games and fractional BBC (Bounded Budget Connection) games. BGP is the glue that holds the Internet together and hence its stability, i.e. the equilibria of fractional BGP games [15], is a matter of practical importance. BBC games [21] follow in the tradition o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2015.02.002